An Efficient Polynomial Time Algorithm for a Class of Generalized Linear Multiplicative Programs with Positive Exponents

This paper explains a region-division-linearization algorithm for solving class of generalized linear multiplicative programs (GLMPs) with positive exponent. In this algorithm, the original nonconvex problem GLMP is transformed into series programming problems by dividing outer space finite polynomial rectangles. A new two-stage acceleration technique put in place to improve computational efficiency which removes part region optimal solution without space. addition, global convergence discussed, and complexity investigated. It demonstrates that complete time approximation scheme. Finally, numerical results show effective feasible.